Cryptanalysis of the Cryptosystem Based on DLP gamma = alphaabetab
نویسنده
چکیده
A critique of the proposed encryption scheme based on the DLP γ = αβ is provided. It is described how a plaintext can be obtained from a valid ciphertext by computing a single traditional discrete logarithm in a cyclic group. Furthermore, it is shown that the proposed encryption scheme is in fact equivalent to the ElGamal encryption scheme.
منابع مشابه
A Cryptosystem Based on DLP gamma = alphaabetab mod p
This paper introduces mainly the concept of the Public Key Cryptosystem or PKC, whose security is based on the new Discrete Logarithm Problem known as DLP-III and DLP-IV with the two distinct exponentiations, i.e. γ ≡ αβ mod p in the multiplicative group of the finite field Z∗ p of the order p − 1. We show that the proposed Public Key Cryptosystem based on DLP-IV provides more security because ...
متن کاملCryptanalysis of the Cryptosystem Based on DLP γ = α a β b
A critique of the proposed encryption scheme based on the DLP γ = αβ is provided. It is described how a plaintext can be obtained from a valid ciphertext by computing a single traditional discrete logarithm in a cyclic group. Furthermore, it is shown that the proposed encryption scheme is in fact equivalent to the ElGamal encryption scheme.
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملResolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures
In cryptanalysis, solving the discrete logarithm problem (DLP) is key to assessing the security of many public-key cryptosystems. The index-calculus methods, that attack the DLP in multiplicative subgroups of finite fields, require solving large sparse systems of linear equations modulo large primes. This article deals with how we can run this computation on GPUand multi-core-based clusters, fe...
متن کاملA Factoring and Discrete Logarithm based Cryptosystem
This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined during the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient publi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 6 شماره
صفحات -
تاریخ انتشار 2008